A Protocol for Secure 2-Party Computation
نویسنده
چکیده
We present a protocol for secure 2-party computation based on homomorphic encryption along with a basic implementation of the protocol. Secure 2-party computation allows two parties to compute some function of their respective inputs in collaboration without revealing the inputs, unless both parties agree to do so. The presented protocol is based on additive sharing and homomorphic encryption and useful in a simple self trust scenario where neither of the parties trust each other.
منابع مشابه
Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation
Secure sum computation of private data inputs is an important component of Secure Multi-party Computation (SMC).In this paper we provide a protocol to compute the sum of individual data inputs with zero probability of data leakage. In our proposed protocol we break input of each party into number of segments and change the arrangement of the parties such that in each round of the computation th...
متن کاملEfficient Multi-Party Computation Secure Against a Faulty Minority
We consider the communication complexity of secure multi-party computation protocols in the cryptographic model. In this model, the adversary is allowed to corrupt up to t of the n players, for any t < n/2. The most efficient protocol known for this model requires Ω(cnκ) bits of communication for securely evaluating a circuit of size c, where κ denotes a security parameter [CDN01]. We present a...
متن کاملABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
Secure computation enables mutually distrusting parties to jointly evaluate a function on their private inputs without revealing anything but the function’s output. Generic secure computation protocols in the semi-honest model have been studied extensively and several best practices have evolved. In this work, we design and implement a mixed-protocol framework, called ABY, that efficiently comb...
متن کاملFair Secure Two-Party Computation
We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of g...
متن کاملDistributed Paillier Plaintext Equivalence Test
Consider the following scenario with N +2 parties, A, B, X1, X2, · · · , XN . Party A has a secret a, party B has a secret b, and party Xi has a secret xi, for i = 1, · · · , N . They want to know if a = b without revealing any information about their secrets. We propose a distributed protocol for this problem based on the Paillier threshold homomorphic encryption scheme with a public broadcast...
متن کامل